Probabilistic satisfiability
نویسندگان
چکیده
منابع مشابه
Probabilistic Satisfiability
Given an arbitrary boolean expression, satisfiability (SAT) refers to the task of finding a truth assignment to the boolean variables that makes the expression true. For example, the boolean expression a & b is true if and only if the boolean variables a and b are true. Satisfiability is of interest to the logic, operations research, and computational complexity communities. Due to the emphasis...
متن کاملClassical Generalized Probabilistic Satisfiability
We analyze a classical generalized probabilistic satisfiability problem (GGenPSAT) which consists in deciding the satisfiability of Boolean combinations of linear inequalities involving probabilities of classical propositional formulas. GGenPSAT coincides precisely with the satisfiability problem of the probabilistic logic of Fagin et al. and was proved to be NP-complete. Here, we present a pol...
متن کاملProbabilistic Satisfiability with Imprecise Probabilities
Treatment of imprecise probabilities within the probabilistic satis®ability approach to uncertainty in knowledge-based systems is surveyed and discussed. Both probability intervals and qualitative probabilities are considered. Analytical and numerical methods to test coherence and bound the probability of a conclusion are reviewed. They use polyhedral combinatorics and advanced methods of linea...
متن کاملProbabilistic Analysis of Satisfiability Algorithms
Probabilistic and average-case analysis can give useful insight into the question of what algorithms for testing satisfiability might be effective and why. Under certain circumstances, one or more structural properties shared by each of a family or class of expressions may be exploited to solve such expressions efficiently; or structural properties might force a class of algorithms to require s...
متن کاملAPPSSAT: Approximate Probabilistic Planning Using Stochastic Satisfiability
We describe APPSSAT, an anytime probabilistic contingent planner based on ZANDER, a probabilistic contingent planner that operates by converting the planning problem to a stochastic satisfiability (Ssat) problem and solving that problem instead [1]. The values of some of the variables in an Ssat instance are probabilistically determined; APPSSAT considers the most likely instantiations of these...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Complexity
سال: 1988
ISSN: 0885-064X
DOI: 10.1016/0885-064x(88)90006-4